Efficient subgraph search over large uncertain graphs
نویسندگان
چکیده
منابع مشابه
Efficient Subgraph Search over Large Uncertain Graphs
Retrieving graphs containing a query graph from a large graph database is a key task in many graph-based applications, including chemical compounds discovery, protein complex prediction, and structural pattern recognition. However, graph data handled by these applications is often noisy, incomplete, and inaccurate because of the way the data is produced. In this paper,we study subgraph queries ...
متن کاملSubgraph Search over Massive Disk Resident Graphs
Due to the wide applications, subgraph queries have attracted lots of attentions in database community. In this paper, we focus on subgraph queries over a large graph G. Different from existing feature-based approaches, we propose a bitmap structure based on edges to index the graph. At run time, we decompose Q into a set of adjacent edge pairs (AEP). We develop edge join (EJ) algorithms to add...
متن کاملSubgraph Similarity Search in Large Graphs
One of the major challenges in applications related to social networks, computational biology, collaboration networks etc., is to efficiently search for similar patterns in their underlying graphs. These graphs are typically noisy and contain thousands of vertices and millions of edges. In many cases, the graphs are unlabeled and the notion of similarity is also not well defined. We study the p...
متن کاملAnswering Subgraph Queries over Large Graphs
Recently, subgraph queries over large graph-structured data have attracted lots of attentions. Most of the recent algorithms proposed to solve this problem apply the structural features of graphs to construct the index, such as path, tree and subgraph. However, there is no a solid theory foundation of which structure is the best one to construct the index. What is more, the cost of mining these...
متن کاملTime Constrained Continuous Subgraph Search over Streaming Graphs
The growing popularity of dynamic applications such as social networks provides a promising way to detect valuable information in real time. Efficient analysis over high-speed data from dynamic applications is of great significance. Data from these dynamic applications can be easily modeled as streaming graph. In this paper, we study the subgraph (isomorphism) search over streaming graph data t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2011
ISSN: 2150-8097
DOI: 10.14778/3402707.3402726